Aggregation methods for efficient collocation detection

نویسندگان

  • Anca Dinu
  • Liviu P. Dinu
  • Ionut Sorodoc
چکیده

In this article we propose a rank aggregation method for the task of collocations detection. It consists of applying some well-known methods (e.g. Dice method, chi-square test, z-test and likelihood ratio) and then aggregating the resulting collocations rankings by rank distance and Borda score. These two aggregation methods are especially well suited for the task, since the results of each individual method naturally forms a ranking of collocations. Combination methods are known to usually improve the results, and indeed, the proposed aggregation method performs better then each individual method taken in isolation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE COMPARISON OF EFFICIENT RADIAL BASIS FUNCTIONS COLLOCATION METHODS FOR NUMERICAL SOLUTION OF THE PARABOLIC PDE’S

In this paper, we apply the compare the collocation methods of meshfree RBF over differential equation containing partial derivation of one dimension time dependent with a compound boundary nonlocal condition.

متن کامل

An Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme

We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...

متن کامل

SOLVING SINGULAR ODES IN UNBOUNDED DOMAINS WITH SINC-COLLOCATION METHOD

Spectral approximations for ODEs in unbounded domains have only received limited attention. In many applicable problems, singular initial value problems arise. In solving these problems, most of numerical methods have difficulties and often could not pass the singular point successfully. In this paper, we apply the sinc-collocation method for solving singular initial value problems. The ability...

متن کامل

Theoretical analysis of Sinc-collocation methods and Sinc-Nyström methods for initial value problems

A Sinc-collocation method has been proposed by Stenger, and he also gave theoretical analysis of the method in the case of a ‘scalar’ equation. This paper extends the theoretical results to the case of a ‘system’ of equations. Furthermore, this paper proposes more efficient method by replacing the variable transformation employed in Stenger’s method. The efficiency is confirmed by both of theor...

متن کامل

High-Order Collocation Methods for Differential Equations with Random Inputs

Recently there has been a growing interest in designing efficient methods for the solution of ordinary/partial differential equations with random inputs. To this end, stochastic Galerkin methods appear to be superior to other nonsampling methods and, in many cases, to several sampling methods. However, when the governing equations take complicated forms, numerical implementations of stochastic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014